Vertex-distinguishing IE-total colorings of complete bipartite graphs K_{m,n}(m<n)
نویسندگان
چکیده
منابع مشابه
Vertex-distinguishing IE-total colorings of complete bipartite graphs Km, n(m<n)
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f . For an IE-total coloring f of G using k colors, if C(u) 6= C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-color...
متن کاملGap vertex-distinguishing edge colorings of graphs
In this paper, we study a new coloring parameter of graphs called the gap vertexdistinguishing edge coloring. It consists in an edge-coloring of a graph G which induces a vertex distinguishing labeling of G such that the label of each vertex is given by the difference between the highest and the lowest colors of its adjacent edges. The minimum number of colors required for a gap vertex-distingu...
متن کاملVertex-distinguishing edge colorings of graphs
We consider lower bounds on the the vertex-distinguishing edge chromatic number of graphs and prove that these are compatible with a conjecture of Burris and Schelp [8]. We also find upper bounds on this number for certain regular graphs G of low degree and hence verify the conjecture for a reasonably large class of such graphs.
متن کاملVertex-distinguishing edge colorings of random graphs
A proper edge coloring of a simple graph G is called vertex-distinguishing if no two distinct vertices are incident to the same set of colors. We prove that the minimum number of colors required for a vertex-distinguishing coloring of a random graph of order n is almost always equal to the maximum degree ∆(G) of the graph.
متن کاملVertex-Magic Total Labelings of Complete Bipartite Graphs
A vertex-magic total labeling on a graph G is a one-to-one map λ from V (G) ∪E(G) onto the integers 1, 2, · · · , |V (G) ∪E(G)| with the property that, given any vertex x, λ(x) + ∑ y∼x λ(y) = k for some constant k. In this paper we completely determine which complete bipartite graphs have vertex-magic total labelings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2013
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1659